package keke;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


interface StringStack {
	public String push(String item);
	public String pop(); 
}

class ArrayListStringStack implements StringStack {
	private List<String>list;
	
	public ArrayListStringStack(){
		list = new ArrayList<String>();
	}
	
	@Override
	public String push(String item) {
		if(item==null)
			return null;
		list.add(item);
			return item;
	}

	@Override
	public String pop() {
		if(list.isEmpty())
			return null;
		return list.remove(list.size()-1);
			
	}
}
public class Main201521123006 {
	public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        String str=in.next();
        int len=str.length()/2;
        String flag="true";
        StringStack stack1=new ArrayListStringStack();
        StringStack stack2=new ArrayListStringStack();
        for(int i = 0;i<len;i++){
        	stack1.push(String.valueOf(str.charAt(i)));
        	stack2.push(String.valueOf(str.charAt(str.length()-i-1)));
        }
        for(int j=len-1;j>=0;j--){
        	if(!(stack1.pop().equals(stack2.pop()))){
        		flag="flase";
        		break;
        	}
        }
        System.out.println(flag);
	}
}